k-strong spanning local tournaments in locally semicomplete digraphsBANG-JENSEN, Jørgen.Discrete applied mathematics. 2009, Vol 157, Num 11, pp 2536-2540, issn 0166-218X, 5 p.Article

The structure of strong arc-locally semicomplete digraphsBANG-JENSEN, Jørgen.Discrete mathematics. 2004, Vol 283, Num 1-3, pp 1-6, issn 0012-365X, 6 p.Article

Disjoint directed and undirected paths and cycles in digraphsBANG-JENSEN, Jørgen; KRIESELL, Matthias.Theoretical computer science. 2009, Vol 410, Num 47-49, pp 5138-5144, issn 0304-3975, 7 p.Article

Splitting off edges within a specified subset preserving the edge-connectivity of the graphBANG-JENSEN, Jørgen; JORDAN, Tibor.Journal of algorithms (Print). 2000, Vol 37, Num 2, pp 326-343, issn 0196-6774Article

Efficient algorithms for real-life instances of the variable size bin packing problemBANG-JENSEN, Jørgen; LARSEN, Rune.Computers & operations research. 2012, Vol 39, Num 11, pp 2848-2857, issn 0305-0548, 10 p.Article

The minimum spanning strong subdigraph problem is fixed parameter tractableBANG-JENSEN, Jørgen; YEO, Anders.Discrete applied mathematics. 2008, Vol 156, Num 15, pp 2924-2929, issn 0166-218X, 6 p.Article

The minimum spanning strong subdigraph problem for extended semicomplete digraphs and semicomplete bipartite digraphsBANG-JENSEN, Jørgen; YEO, Anders.Journal of algorithms (Print). 2001, Vol 41, Num 1, pp 1-19, issn 0196-6774Article

On Persistent Directed GraphsBANG-JENSEN, Jorgen; JORDAN, Tibor.Networks (New York, NY). 2008, Vol 52, Num 4, pp 271-276, issn 0028-3045, 6 p.Article

Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphsBANG-JENSEN, Jørgen.Discrete mathematics. 2009, Vol 309, Num 18, pp 5655-5667, issn 0012-365X, 13 p.Article

Recognizing and representing proper interval graphs in parallel using merging and sortingBANG-JENSEN, Jørgen; JING HUANG; IBARRA, Louis et al.Discrete applied mathematics. 2007, Vol 155, Num 4, pp 442-456, issn 0166-218X, 15 p.Article

Longest path partitions in generalizations of tournamentsBANG-JENSEN, Jørgen; NIELSEN, Morten Hegner; YEO, Anders et al.Discrete mathematics. 2006, Vol 306, Num 16, pp 1830-1839, issn 0012-365X, 10 p.Article

Finding complementary cycles in locally semicomplete digraphsBANG-JENSEN, Jørgen; NIELSEN, Morten Hegner.Discrete applied mathematics. 2005, Vol 146, Num 3, pp 245-256, issn 0166-218X, 12 p.Article

Strongly connected spanning subdigraphs with the minimum number of arcs in quasi-transitive digraphsBANG-JENSEN, Jørgen; HUANG, Jing; YEO, Anders et al.SIAM journal on discrete mathematics (Print). 2003, Vol 16, Num 2, pp 335-343, issn 0895-4801, 9 p.Article

A Computational Investigation of Heuristic Algorithms for 2-Edge-Connectivity AugmentationBANG-JENSEN, Jorgen; CHIARANDINI, Marco; MORLING, Peter et al.Networks (New York, NY). 2010, Vol 55, Num 4, pp 299-325, issn 0028-3045, 27 p.Article

Spanning 2-strong tournaments in 3-strong semicomplete digraphsBANG-JENSEN, Jorgen; JORDAN, Tibor.Discrete mathematics. 2010, Vol 310, Num 9, pp 1424-1428, issn 0012-365X, 5 p.Conference Paper

Making a tournament k-arc-strong by reversing or deorienting arcsBANG-JENSEN, Jorgen; YEO, Anders.Discrete applied mathematics. 2004, Vol 136, Num 2-3, pp 161-171, issn 0166-218X, 11 p.Conference Paper

The complexity of colouring by locally semicomplete digraphsBANG-JENSEN, Jorgen; MACGILLIVRAY, Gary; SWARTS, Jacobus et al.Discrete mathematics. 2010, Vol 310, Num 20, pp 2675-2684, issn 0012-365X, 10 p.Article

Splitting off edges between two subsets preserving the edge-connectivity of the graphBANG-JENSEN, Jorgen; JORDAN, Tibor.Discrete mathematics. 2004, Vol 276, Num 1-3, pp 5-28, issn 0012-365X, 24 p.Conference Paper

Distance-restricted matching extension in planar triangulationsALDRED, R. E. L; PLUMMER, Michael D.Discrete mathematics. 2010, Vol 310, Num 20, pp 2618-2636, issn 0012-365X, 19 p.Article

Openly disjoint circuits through a vertex in regular digraphsMADER, W.Discrete mathematics. 2010, Vol 310, Num 20, pp 2671-2674, issn 0012-365X, 4 p.Article

The thickness and chromatic number of r-inflated graphsALBERTSON, Michael O; BOUTIN, Debra L; GETHNER, Ellen et al.Discrete mathematics. 2010, Vol 310, Num 20, pp 2725-2734, issn 0012-365X, 10 p.Article

A note on traversing specified vertices in graphs embedded with large representativityKAWARABAYASHI, Ken-Ichi; PLUMMER, Michael D.Discrete mathematics. 2010, Vol 310, Num 20, pp 2655-2661, issn 0012-365X, 7 p.Article

Approximation algorithms for the minimum rainbow subgraph problemCAMACHO, Stephan Matos; SCHIERMEYER, Ingo; TUZA, Zsott et al.Discrete mathematics. 2010, Vol 310, Num 20, pp 2666-2670, issn 0012-365X, 5 p.Article

Strong embeddings of minimum genusMOHAR, Bojan.Discrete mathematics. 2010, Vol 310, Num 20, pp 2595-2599, issn 0012-365X, 5 p.Article

Homomorphisms from sparse graphs to the Petersen graphMIN CHEN; RASPAUD, André.Discrete mathematics. 2010, Vol 310, Num 20, pp 2705-2713, issn 0012-365X, 9 p.Article